Reducing the time needed to solve a traveling salesman problem by clustering with a Hierarchy-based algorithm

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p>In this study, we compare a cluster-based whale optimization algorithm (WOA) with an uncombined method to find more optimized solution for traveling salesman problem (TSP). The main goal is reduce the time of solving TSP. First, solve TSP Whale algorithm, later it combined which uses clustering method, called BIRCH (balanced iterative reducing and using hierarchies). Birch builds feature (CF) tree then applies one methods (for ex. K-means) cluster data. Experiments performed on three datasets show that convergence improves by algorithm.</p></div></div></div>